(Conformally) semisymmetric spaces and special semisymmetric Weyl tensors

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semisymmetric graphs from polytopes

Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which are edgebut not vertex-transitive). In particular, the Gray graph arises as the medial layer graph of a certain universal locally toroidal regular 4-polytope.

متن کامل

Cubic Semisymmetric Graphs of Order 2p 3 Semisymmetric Graphs of Order 2p 3

A regular graph is called semisymmetric if it is edge-transitive but not vertex-transitive. It is proved that the Gray graph is the only cubic semisymmetric graph of order 2p3, where p 3 is a prime.

متن کامل

Affine Primitive Groups and Semisymmetric Graphs

In this paper, we investigate semisymmetric graphs which arise from affine primitive permutation groups. We give a characterization of such graphs, and then construct an infinite family of semisymmetric graphs which contains the Gray graph as the third smallest member. Then, as a consequence, we obtain a factorization of the complete bipartite graph Kpspt ,psp into connected semisymmetric graph...

متن کامل

A worthy family of semisymmetric graphs

In this paper, we construct semisymmetric graphs in which no two vertices have exactly the same neighbors. We show how to do this by /rst considering bi-transitive graphs, and then we show how to choose two such graphs so that their product is regular. We display a family of bi-transitive graphs DN (a; b) which can be used for this purpose and we show that their products are semisymmetric by ap...

متن کامل

Semisymmetric cubic graphs of twice odd order

Suppose that Γ is a connected graph and G is a subgroup of the automorphism group Aut(Γ) of Γ. Then Γ is G-symmetric if G acts transitively on the arcs (and so the vertices) of Γ and Γ is G-semisymmetric if G acts edge transitively but not vertex transitively on Γ. If Γ is Aut(Γ)symmetric, respectively, Aut(Γ)-semisymmetric, then we say that Γ is symmetric, respectively, semisymmetric. If Γ is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2011

ISSN: 1742-6596

DOI: 10.1088/1742-6596/314/1/012019